Task Partitioning and Load Balancing Strategy for Matrix Applications on Distributed System
نویسندگان
چکیده
In this paper, we present a load-balancing strategy (Adaptive Load Balancing strategy) for data parallel applications to balance the work load effectively on a distributed system. We study its impact on computation-hungry matrix multiplication application. The ALB strategy enhances the performance with features such as intelligent node selection, pre-task assignment, adaptive task sizing and buffer allocation, and load balancing. The ALB strategy exhibits reduced nodes idle time and inter process communication time, and improved speed up as compared to Run Time task Scheduling strategy.
منابع مشابه
Classification of Task Partitioning and Load Balancing Strategies in Distributed Parallel Computing Systems
Distribution of the tasks amongst the various computing nodes is itself an intellectually challenging problem in the high performance distributed computing systems. To choose the appropriate strategy for the required system is difficult without the meaningful comparison of the existing task partitioning and load balancing strategies. The effectiveness of the strategy depend on the number of fac...
متن کاملPractical Experiences with Task Scheduling Strategies for Image Processing Application on Heterogeneous Distributed Computing System
Heterogeneous Distributed Computing (HDC) system consists of Workstations (WSs) and Personal Computers (PCs). In HDC system, each WS/PC may have different processor and performance. In order to take advantage of this diversity of processing power of a system, an effective task partitioning, scheduling, and load balancing are needed to get the optimum performance. This paper examines the effecti...
متن کاملLoad Balancing Problem for Parallel Computers with Distributed Memory
This paper deals with load balancing of parallel algorithms for distributedmemory computers. The parallel versions of BLAS subroutines for matrix-vector product and LU factorization are considered. Two task partitioning algorithms are investigated and speed-ups are calculated. The cases of homogeneous and heterogeneous collections of computers/processors are studied, and special partitioning al...
متن کاملAn Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کاملCloud Partitioning Based Secured Load balancing Approach for Public Cloud Infrastructure
There has been a great significance of dynamic load balancing strategies for public cloud infrastructures (PCIs). An optimized load balancing strategy can enhance the performance of PCIs many folds. The predominant requirements for optimal public cloud are the efficient resource utilization and data security. On the other hand the dynamic load scheduling can make cloud system operational effici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCP
دوره 8 شماره
صفحات -
تاریخ انتشار 2013